$NP/CLP$ Equivalence: A Phenomenon Hidden Among Sparsity Models for Information Processing
نویسندگان
چکیده
It is proved in this paper that to every underdetermined linear system Ax = b there corresponds a constant p(A, b) > 0 such that every solution to the lp-norm minimization problem also solves the l0-norm minimization problem whenever 0 < p < p(A, b). This phenomenon is named NP/CLP equivalence.
منابع مشابه
Do Heavy-NP Shift Phenomenon and Constituent Ordering in English Cause Sentence Processing Difficulty for EFL Learners?
Heavy-NP shift occurs when speakers prefer placing lengthy or “heavy” noun phrase direct objects in the clause-final position within a sentence rather than in the post-verbal position. Two experiments were conducted in this study, and their results suggested that having a long noun phrase affected the ordering of constituents (the noun phrase and prepositional phrase) by advanced Iranian EFL le...
متن کاملMinimization for Information Processing
In this paper, we have proved that in every underdetermined linear system Ax = b there corresponds a constant p∗(A, b) > 0 such that every solution to the lp-norm minimization problem also solves the l0-norm minimization problem whenever 0 < p < p∗(A, b). This phenomenon is named NP/CMP equivalence.
متن کاملImproving Phoneme Sequence Recognition using Phoneme Duration Information in DNN-HSMM
Improving phoneme recognition has attracted the attention of many researchers due to its applications in various fields of speech processing. Recent research achievements show that using deep neural network (DNN) in speech recognition systems significantly improves the performance of these systems. There are two phases in DNN-based phoneme recognition systems including training and testing. Mos...
متن کاملProbabilistic Automata with Parameters
Probabilistic automata were introduced by Rabin in early 1960s. We extend this concept by allowing transition probabilities among the states to be parametric. Two main decision problems are considered: the language equivalence and bisimulation of probabilistic automata. One of our main results is a new one sided error Monte Carlo randomized polynomial-time algorithm for the universal equivalenc...
متن کاملTurkish PoS Tagging by Reducing Sparsity with Morpheme Tags in Small Datasets
Sparsity is one of the major problems in natural language processing. The problem becomes even more severe in agglutinating languages that are highly prone to be inflected. We deal with sparsity in Turkish by adopting morphological features for part-of-speech tagging. We learn inflectional and derivational morpheme tags in Turkish by using conditional random fields (CRF) and we employ the morph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1501.02018 شماره
صفحات -
تاریخ انتشار 2015